Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182)

This report documents the program and the outcomes of Dagstuhl Seminar 11182 “Exploiting graph structure to cope with hard problems” which has been held in Schloss Dagstuhl – Leibniz Center for Informatics from May 1st, 2011 to May 6th, 2011. During the seminar experts with a common focus on graph algorithms presented various new results in how to attack NP-hard graph problems by using the structure of the input graph. Moreover, in the afternoon of each seminar’s day new problems have been posed and discussed. Seminar 01.–06. May, 2011 – www.dagstuhl.de/11182 1998 ACM Subject Classification G.2.1 Combinatorics, G.2.2 Graph Theory, G.2.3 Applications, F.2.2 Nonnumerical Algorithms and Problems, F.2.3 Tradeoffs among Complexity Measures